Displacement Structure Approach to Polynomial Vandermonde and Related Matrices
نویسندگان
چکیده
In this paper we introduce a new class of what we shall call polynomial Vandermonde-like matrices. This class generalizes the polynomial Vandermonde matrices studied earlier by various authors, who derived explicit inversion formulas and fast algorithms for inversion and for solving the associated linear systems. A displacement structure approach allows us to carry over all these results to the wider class of polynomial Vandermonde-like matrices. |||||||||||||||||||||||||||||||||||||||
منابع مشابه
Displacement Structure Approach to PolynomialVandermonde and Related
||||||||||||||||||||||||||||||||||||||| ABSTRACT In this paper we introduce a new class of what we shall call polynomial Vandermonde-like matrices. This class generalizes the polynomial Vandermonde matrices studied earlier by various authors, who derived explicit inversion formulas and fast algorithms for inversion and for solving the associated linear systems. A displacement structure approach...
متن کاملA Fast Algorithm for the Inversion of Quasiseparable Vandermonde-like Matrices
The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasise...
متن کاملNew Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملAccurate SVDs of Structured Matrices
We present new O(n) algorithms to compute very accurate SVDs of Cauchy matrices, Vandermonde matrices, and related \unit-displacement-rank" matrices. These algorithms compute all the singular values with guaranteed relative accuracy, independent of their dynamic range. In contrast, previous O(n) algorithms can potentially lose all relative accuracy in the tiniest singular values. LAPACK Working...
متن کاملA Study of Vandermonde-like Matrix Systems With Emphasis on Preconditioning and Krylov Matrix Connection
The study focuses primarily on Vandermonde-like matrix systems. The idea is to express Vandermonde and Vandermonde-like matrix systems as the problems related to Krylov Matrices. The connection provides a different angle to view the Vandermondelike systems. Krylov subspace methods are strongly related to polynomial spaces, hence a nice connection can be established using LU factorization as pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995